New lattice attacks on DSA schemes
نویسنده
چکیده
We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently. Using this result we develop attacks against the DSA schemes which, under some assumptions, can provide the secret key in the case where one or several signed messages are available. MSC 2010: 94A60, 11T71, 11Y16.
منابع مشابه
Lattice Attacks on DSA Schemes Based on Lagrange's Algorithm
Using Lagrange’s algorithm for the computation of a basis of a 2-dimensional lattice formed by two successive minima, we present some attacks on DSA and ECDSA which permit us, under some assumptions, to compute the secret key of the scheme provided that one or two signed messages are given. MSC 2010: 94A60, 11T71, 11Y16.
متن کاملLattice Attacks on Digital Signature Schemes
We describe a lattice attack on the Digital Signature Algorithm (DSA) when used to sign many messages, mi, under the assumption that a proportion of the bits of each of the associated ephemeral keys, yi, can be recovered by alternative techniques.
متن کاملOn the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
In the ordinary security model for signature schemes, we consider an adversary that may forge a signature on a new message using only his knowledge of other valid message and signature pairs. To take into account side channel attacks such as tampering or fault-injection attacks, Bellare and Kohno (Eurocrypt 2003) formalized related-key attacks (RKA), where stronger adversaries are considered. I...
متن کاملKey-collisions in (EC)DSA: Attacking Non-repudiation
A new kind of attack on the non-repudiation property of digital signature schemes is presented. We introduce a notion of key-collisions, which may allow an attacker to claim that the message (presented to a judge) has been signed by someone else. We show how to compute keycollisions for the DSA and ECDSA signature schemes effectively. The main idea of these attacks has been inspired by the well...
متن کاملFault Attacks on Public Key Elements: Application to DLP-Based Schemes
Many cryptosystems suffer from fault attacks when implemented in physical devices such as smart cards. Fault attacks on secret key elements have successfully targeted many protocols relying on the Elliptic Curve Discrete Logarithm Problem (ECDLP), the Integer Factorization Problem (IFP) or the Discrete Logarithm Problem (DLP). More recently, faults attacks have also been designed against the pu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Mathematical Cryptology
دوره 10 شماره
صفحات -
تاریخ انتشار 2016